
Context%2Daware generalization for cube measures.

Motifs graduels clos.

Aide %E0 la d%E9cision pour la maintenance ferroviaire pr%E9ventive.

Requ%EAtes Skyline avec prise en compte des pr%E9f%E9rences utilisateurs pour des donn%E9es volumineuses.

Salines  un automate au service de l%27extraction de motifs s%E9quentiels multidimensionnels.

Bien cube%2C les donn%E9es textuelles peuvent s%27agr%E9ger %21

Une structure bas%E9e sur les hi%E9rarchies pour synth%E9tiser les itemsets fr%E9quents extraits dans des fen%EAtres temporelles.

Mining Closed Gradual Patterns.
With the steady development of the computing tools, we attended last three decades a considerable increase of the quantity of data stored in databases. So, extracting knowledge from this data is of paramount importance. Data mining is becoming an inescapable tool to reach this goal. Association rule extraction is one
Passage Retrieval in Log Files An Approach Based on Query Enrichment.
Abstract. The question answering systems are considered the next generation of search engines. This paper focuses on the first step of this process, which is to search for relevant passages containing answers. Passage Retrieval, can be difficult because of the complexity of data, log files in our case. Our contribution is based on the enrichment of queries by using a learning method and a novel term weighting function. This original term weighting function, used within the enrichment process, aims to assign a weight to terms according to their relatedness to the context of answers. Experiments conducted on real data show that our protocol of primitive query enrichment make it possible to retrieve relevant passages. 1
MAD%2DIDS Novel Intrusion Detection System Using Mobile Agents and Data Mining Approaches.
Abstract. Intrusion Detection has been investigated for many years and the field reached the maturity. Nevertheless, there are still important challenges, e.g., how an Intrusion Detection System (IDS) can detect new and complex distributed attacks. To tackle this problem, we propose a novel distributed intrusion detection system, based on the desirable features provided by the mobile agent methodology. Our approach rely on: (i) a misuse detection mobile agent to detect known attacks, (ii) an anomaly detection mobile agent to detect novel kinds of attacks. Based on data mining techniques, this agent provides a high accuracy for predicting different behaviors in network computers. Carried out experiments showed the efficiency of data mining approaches integrated with mobile agent technology.
Summarizing Multidimensional Data Streams A Hierarchy%2DGraph%2DBased Approach.
Abstract. With the rapid development of information technology, many applications have to deal with potentially infinite data streams. In such a dynamic context, storing the whole data stream history is unfeasible and providing a high-quality summary is required for decision makers. In this paper, we propose a summarization method for multidimensional data streams based on a graph structure and taking advantage of the data hierarchies. The summarization method we propose takes into account the data distribution and thus overcomes a major drawback of the Tilted Time Window common framework. Finally, we adapt this structure for synthesizing frequent itemsets extracted on temporal windows. Thanks to our approach, as users do not analyze any more numerous extraction results, the result processing is improved. Experiments conducted on both synthetic and real datasets show that our approach can be applied on data streams. 1
Extraction of unexpected sentences A sentiment classification assessed approach.
Sentiment classification in text documents is an active data mining research topic in opinion retrieval and analysis. Different from previous studies concentrating on the development of effective classifiers, in this paper, we focus on the extraction and validation of unexpected sentences issued in sentiment classification. In this paper, we propose a general framework for determining unexpected sentences. The relevance of the extracted unexpected sentences is assessed in the context of text classification. In the experiments, we present the extraction of unexpected 1 sentences for sentiment classification within the proposed framework, and then evaluate the influence of unexpected sentences on the quality of classification tasks. The experimental results show the effectiveness and usefulness of our proposed approach.
Fen%EAtres sur cube.

Extraction of unexpected sentences A sentiment classification assessed approach.
Sentiment classification in text documents is an active data mining research topic in opinion retrieval and analysis. Different from previous studies concentrating on the development of effective classifiers, in this paper, we focus on the extraction and validation of unexpected sentences issued in sentiment classification. In this paper, we propose a general framework for determining unexpected sentences. The relevance of the extracted unexpected sentences is assessed in the context of text classification. In the experiments, we present the extraction of unexpected 1 sentences for sentiment classification within the proposed framework, and then evaluate the influence of unexpected sentences on the quality of classification tasks. The experimental results show the effectiveness and usefulness of our proposed approach.
Speed up gradual rule mining from stream data%21 A B%2DTree and OWA%2Dbased approach.
Gradual rules allow users to be provided with rules describing the ordering correlations among attributes. Such a rule is for instance given by the higher the salary and the lower the number of cars, the higher the number of tourist travels. Previously intensively used in fuzzy command systems, these rules were manually provided to the system. More recently, they have received attention from the data mining community and methods have been defined to automatically extract and maintain gradual rules from numerical databases. However, no method has been shown to be able to handle data streams, as no method is scalable enough to manage the high rate which stream data arrive at. In this paper, we thus propose an original approach to mine data streams for gradual rules. Our method is based on B-Trees and OWA (Ordered Weighted Aggregation) operator in order to speed up the process. B-Trees are used to store already-known gradual rules in order to maintain the knowledge over time, while OWA operators provide a fast way to discard non relevant data.
Multidimensional Data Stream Summarization Using Extended Tilted%2DTime Windows.

SAX a privacy preserving general pupose methodapplied to detection of intrusions.

A novel approach for privacy mining of generic basic association rules.

Terminology Extraction from Log Files.
In many domains, the log files generated by digital systems contain important information on the conditions and configurations of systems. Information Extraction from these log files is an essential phase in information systems, which manage the production line. In the case of Integrated Circuit designs, log files generated by design tools are not exhaustively exploited. Although these log files are written in English, they usually do not respect the grammar and the structures of natural language. Moreover, such logs have a heterogeneous and evolving structure. According to features of such textual data, applying the classical methods of information extraction is not an easy task, more particularly for terminology extraction. In this paper, we thus introduce our approach EXTERLOG to extract the terminology from such log files. We also aim at knowing if POS tagging of such log files is a relevant approach for terminology extraction. 1
SPAMS Une nouvelle approche incr%E9mentale pour l%27extraction de motifs s%E9quentiels fr%E9quents dans les data streams.



Collaborative Outlier Mining for Intrusion Detection.

Collaborative Outlier Mining for Intrusion Detection.

SPAMS A Novel Incremental Approach for Sequential Pattern Mining in Data Streams.
Abstract Mining sequential patterns in data streams is a new challenging problem for the datamining community since data arrives sequentially in the form of continuous rapid and infinite streams. In this paper, we propose a new on-line algorithm, SPAMS, to deal with the sequential patterns mining problem in data streams. This algorithm uses an automaton-based structure to maintain the set of frequent sequential patterns, i.e. SPA (Sequential Pattern Automaton). The sequential pattern automaton can be smaller than the set of frequent sequential patterns by two or more orders of magnitude, which allows us to overcome the problem of combinatorial explosion of sequential patterns. Current results can be output constantly on any user’s specified thresholds. In addition, taking into account the characteristics of data streams, we propose a well-suited method said to be approximate since we can provide near optimal results with a high probability. Experimental studies show the relevance of the SPA data structure and the efficiency of the SPAMS algorithm on various datasets. Our contribution opens a promising gateway, by using an automaton as a data structure for mining frequent sequential patterns in data streams.
Mining Common Outliers for Intrusion Detection.
Abstract Data mining for intrusion detection can be divided into several sub-topics, among which unsupervised clustering (which has controversial properties). Unsupervised clustering for intrusion detection aims to i) group behaviours together depending on their similarity and ii) detect groups containing only one (or very few) behaviour(s). Such isolated behaviours seem to deviate from the model of normality; therefore, they are considered as malicious. Obviously, not all atypical behaviours are attacks or intrusion attempts. This represents one drawback of intrusion detection methods based on clustering. We take into account the addition of a new feature to isolated behaviours before they are considered malicious. This feature is based on the possible repeated occurrences of the bahaviour on many information systems. Based on this feature, we propose a new outlier mining method which we validate through a set of experiments.
Intrusion Detections in Collaborative Organizations by Preserving Privacy.
Abstract To overcome the problem of attacks on networks, new Intrusion Detection System (IDS) approaches have been proposed in recent years. They consist in identifying signatures of known attacks to compare them to each request and determine whether it is an attack or not. However, these methods are set to default when the attack is unknown from the database of signatures. Usually this problem is solved by calling human expertise to update the database of signatures. However, it is frequent that an attack has already been detected by another organization and it would be useful to be able to benefit from this knowledge to enrich the database of signatures. Unfortunately this information is not so easy to obtain. In fact organizations do not necessarily want to spread the information that they have already faced this type of attack. In this paper we propose a new approach to intrusion detection in a collaborative environment but by preserving the privacy of the collaborative organizations. Our approach works for any signature that may be written as a regular expression insuring that no information is disclosed on the content of the sites.
SO%5FMAD SensOr Mining for Anomaly Detection in Railway Data.
Abstract. Today, many industrial companies must face problems raised by maintenance. In particular, the anomaly detection problem is probably one of the most challenging. In this paper we focus on the railway maintenance task and propose to automatically detect anomalies in order to predict in advance potential failures. We first address the problem of characterizing normal behavior. In order to extract interesting patterns, we have developed a method to take into account the contextual criteria associated to railway data (itinerary, weather conditions, etc.). We then measure the compliance of new data, according to extracted knowledge, and provide information about the seriousness and possible causes of a detected anomaly. 1
SS%2DIDS Statistical Signature Based IDS.
Security of web servers has become a sensitive subject today. Prediction of normal and abnormal request is problematic due to large number of false alarms in many anomaly based Intrusion Detection Systems(IDS). SS-IDS derives automatically the parameter profiles from the analyzed data thereby generating the Statistical Signatures. Statistical Signatures are based on modeling of normal requests and their distribution value without explicit intervention. Several attributes are used to calculate the behavior of the legitimate request on the web server. SS-IDS is best suited for the newly installed web servers which doesn’t have large number of requests in the data set to train the IDS and can be used on top of currently used signature based IDS like SNORT. Experiments conducted on real data sets have shown high accuracy up to 99.98 % for predicting valid request as valid and false positive rate ranges from 3.82-7.84%. 1.
Mining for Relevant Terms from Log Files.

Mining for Relevant Terms from Log Files.

A conceptual model for handling personalized hierarchies in multidimensional databases.

Data Mining for Intrusion Detection From Outliers to True Intrusions.
Abstract. Data mining for intrusion detection can be divided into several sub-topics, among which unsupervised clustering has controversial properties. Unsupervised clustering for intrusion detection aims to i) group behaviors together depending on their similarity and ii) detect groups containing only one (or very few) behaviour. Such isolated behaviours are then considered as deviating from a model of normality and are therefore considered as malicious. Obviously, all atypical behaviours are not attacks or intrusion attempts. Hence, this is the limits of unsupervised clustering for intrusion detection. In this paper, we consider to add a new feature to such isolated behaviours before they can be considered as malicious. This feature is based on their possible repetition from one information system to another. 1
Efficient mining of sequential patterns with time constraints Reducing the combinations.

FTMnodes Fuzzy tree mining based on partial inclusion.

Tree mining Equivalence classes for candidate generation.


Web opinion mining how to extract opinions from blogs%3F


Extraction of Opposite Sentiments in Classified Free Format Text Reviews.

Is a Voting Approach Accurate for Opinion Mining%3F.

Mining Conjunctive Sequential Patterns.

%C9chantillonnage pour l%92extraction de motifs s%E9quentiels  des basesde donn%E9es statiques aux flots de donn%E9es.

Le FIA un nouvel automate permettant l%92extraction efficace d%92itemsets fr%E9quents dans les flots de donn%E9es.

FIASCO  un nouvel algorithme d%92extraction d%92itemsets fr%E9quents dans les flots de donn%E9es.

D%E9couverte de motifs s%E9quentiels et r%E8gles inattendues.

Mining Unexpected Web Usage Behaviors.

Mining Unexpected Web Usage Behaviors.



Mining conjunctive sequential patterns.

Vers une nouvelle approche d%27extraction des motifs s%E9quentiels non%2Dd%E9rivables.

Sampling for Sequential Pattern Mining From Static Databases to Data Streams.
Sequential pattern mining is an active field in the domain of knowledge discovery. Recently, with the constant progress in hardware technologies, real-world databases tend to grow larger and the hypothesis that a database can be loaded into main-memory for sequential pattern mining purpose is no longer valid. Furthermore, the new model of data as a continuous and potentially infinite flow, known as data stream model, call for a pre-processing step to ease the mining operations. Since the database size is the most influential factor for mining algorithms we examine the use of sampling over static databases to get approximate mining results with an upper bound on the error rate. Moreover, we extend these sampling analysis and present an algorithm based on reservoir sampling to cope with sequential pattern mining over data streams. We demonstrate with empirical results that our sampling methods are efficient and that sequence mining remains accurate over static databases and data streams. 1
Fuzzy Tree Mining Go Soft on Your Nodes.
Abstract. Tree mining consists in discovering the frequent subtrees from a forest of trees. This problem has many application areas. For instance, a huge volume of data available from the Internet is now described by trees (e.g. XML). Still, for several documents dealing with the same topic, this description is not always the same. It is thus necessary to mine a common structure in order to query these documents. Biology is another field where data may be described by means of trees. The problem of mining trees has now been addressed for several years, leading to well-known algorithms. However, these algorithms can hardly deal with real data in a soft manner. Indeed, they consider a subtree as fully included in the super-tree. This means that all the nodes must appear. In this paper, we extend this definition to fuzzy inclusion based on the idea that a tree is included to a certain degree within another one, this fuzzy degree being correlated to the number of matching nodes. 1

Pr%E9servation de la vie priv%E9e. Recherche de motifs s%E9quentiels dans des bases de donn%E9es distribu%E9es.


Towards a new approach for mining frequent itemsets on data stream.

Mining evolving data streams for frequent patterns.

Peer%2Dto%2DPeer Usage Analysis a Distributed Mining Approach.

Privacy Preserving Sequential Pattern Mining in Distributed Databases.


Privacy preserving sequential pattern mining in distributed databases.


Fouille de donn%E9es dans les syst%E8mes Pair%2D%E0%2DPair pour am%E9liorer la recherche de ressources.

Recherche de sous%2Dstructures fr%E9quentes pour l%27int%E9gration de sch%E9mas XML.

Need For Speed  Mining Sequential Patterns in Data Streams.
Abstract — Recently, the data mining community has focused on a new challenging model where data arrives sequentially in the form of continuous rapid streams. It is often referred to as data streams or streaming data. Many real-world applications data are more appropriately handled by the data stream model than by traditional static databases. Such applications can be: stock tickers, network traffic measurements, transaction flows in retail chains, click streams, sensor networks and telecommunications call records. In this paper we propose a new approach, called SPEED (Sequential Patterns Efficient Extraction in Data streams), to identify sequential patterns in a data stream. To the best of our knowledge this is the first approach defined for mining sequential patterns in streaming data. The main originality of our mining method is that we use a novel data structure to maintain frequent sequential patterns coupled with a fast pruning strategy. At any time, users can issue requests for frequent sequences over an arbitrary time interval. Furthermore, our approach produces an approximate support answer with an assurance that it will not bypass a user-defined frequency error threshold. Finally the proposed method is analyzed by a series of experiments on different datasets. I.
On the estimation of frequent itemsets for data streams theory and experiments.

Repr%E9sentation Dynamique de Documents pour une Recherche Documentaire Intelligente.

Tendances dans les expressions de g%E8nes  application %E0 l%27analyse du transcriptome de Plasmodium Falciparum.

Statistical Supports for Frequent Itemsets on Data Streams.
Abstract. A statistical technique is developed for estimating the support of itemsets on data streams, regardless of the size of the data stored. This technique, which is computationally ultra fast, does not depend on the algorithm used to build or maintain the itemsets. On frequent itemsets, it allows to maximize either the precision or the recall, as chosen by the user, while it does not damage the other criterion, and may even yield very good Fβ-measures. Since the maximization of both criteria is statistically hard, this provides algorithms building frequent itemsets with an efficient alternative to find those that are true frequents, when only a partial storing of the data stream is technically available. Experiments demonstrate the potential of the technique. 1
Web Information Retrieval Based on User Profile.

Information Retrieval Model Based on User Profile.

Mod%E9lisation dynamique et temporelle de l%27utilisateur pour un filtrage personnalis%E9 de documents textuels.

LUCI A Personalization Documentary System Based on the Analysis of the History of the User%27s Actions.

Pre%2DProcessing Time Constraints for Efficiently Mining Generalized Sequential Patterns.

AUSMS An Environment for Frequent Sub%2Dstructures Extraction in a Semi%2Dstructured Object Collection.

Extraction de motifs s%E9quentiels. Probl%E8mes et m%E9thodes.

AUSMS An Environment for Frequent Sub%2Dstructures Extraction in a Semi%2Dstructured Object Collection.

AUSMS  un environnement pour l%27extraction de sous%2Dstructures fr%E9quentes dans une collection d%27objets semi%2Dstructur%E9s.

Incremental mining of sequential patterns in large databases.
In this paper we consider the problem of the incremental mining of sequential patterns when new transactions or new customers are added to an original database. We present a new algorithm for mining frequent sequences that uses information collected during an earlier mining process to cut down the cost of finding new sequential patterns in the updated database. Our test shows that the algorithm performs significantly faster than the naive approach of mining on the whole updated database from scratch. The difference is so pronounced that this algorithm could also be useful for mining sequential patterns, since in many cases it is faster to apply our algorithm than to mine sequential patterns using a standard algorithm, by breaking down the database into an original database plus an increment. Key words: Sequential patterns, incremental mining, data mining 1
Web Usage Mining Extraction%2C Maintenance and Behaviour Trends.

Incremental mining of sequential patterns in large databases.
In this paper we consider the problem of the incremental mining of sequential patterns when new transactions or new customers are added to an original database. We present a new algorithm for mining frequent sequences that uses information collected during an earlier mining process to cut down the cost of finding new sequential patterns in the updated database. Our test shows that the algorithm performs significantly faster than the naive approach of mining on the whole updated database from scratch. The difference is so pronounced that this algorithm could also be useful for mining sequential patterns, since in many cases it is faster to apply our algorithm than to mine sequential patterns using a standard algorithm, by breaking down the database into an original database plus an increment. Key words: Sequential patterns, incremental mining, data mining 1
Donn%E9es semi%2Dstructur%E9es. D%E9couverte

HDM A Client%2FServer%2FEngine Architecture for Real%2DTime Web Usage Mining.

HDM
The Enhanced HDM Specification and Verification System being  developed at SRI International includes an &#034;MLS Checker&#034; that automatically  verifies the security of a certain class of system specifications.
Real Time Web Usage Mining with a Distributed Navigation Analysis.

Web Usage Mining Inter%2DSites Analyse du comportement des utilisateurs %E0 impact imm%E9diat.

Real%2DTime Web Usage Mining A Heuristic Based Distributed Miner.

A General Architecture for Finding Structural Regularities on the Web.
With the growing popularity of the World Wide Web, the number of semistructured documents  produced in all types of organizations increases at a rapid rate. However the provided information  cannot be queried or manipulated in the general way since, although there is some structure in the  information, it is too irregular to be modeled using a relational or an object-oriented approach.  Nevertheless, some semistructured objects, for the same type of information, have a very similar  structure. Analysis of such regularities can provide very useful information for restructuring a Web  site, for providing a guideline for building indexes and views and in a general way for applying  conventional database technologies which are mainly schema dependent.  In this paper we address the problem of nding such regularities and we propose a general architecture  based on a data mining technique.  1 Introduction  With the growing popularity of the World Wide Web (Web), the number of semistructured ...
Incremental Mining of Sequential Patterns in Large Databases.
In this paper we consider the problem of the incremental mining of sequential patterns when new transactions or new customers are added to an original database. We present a new algorithm for mining frequent sequences that uses information collected during an earlier mining process to cut down the cost of finding new sequential patterns in the updated database. Our test shows that the algorithm performs significantly faster than the naive approach of mining on the whole updated database from scratch. The difference is so pronounced that this algorithm could also be useful for mining sequential patterns, since in many cases it is faster to apply our algorithm than to mine sequential patterns using a standard algorithm, by breaking down the database into an original database plus an increment. Key words: Sequential patterns, incremental mining, data mining 1
Incremental Mining of Sequential Patterns in Large Databases.
In this paper we consider the problem of the incremental mining of sequential patterns when new transactions or new customers are added to an original database. We present a new algorithm for mining frequent sequences that uses information collected during an earlier mining process to cut down the cost of finding new sequential patterns in the updated database. Our test shows that the algorithm performs significantly faster than the naive approach of mining on the whole updated database from scratch. The difference is so pronounced that this algorithm could also be useful for mining sequential patterns, since in many cases it is faster to apply our algorithm than to mine sequential patterns using a standard algorithm, by breaking down the database into an original database plus an increment. Key words: Sequential patterns, incremental mining, data mining 1
Schema Mining Finding Structural Regularity among Semistructured Data.

Web Usage Mining How to Efficiently Manage New Transactions and New Clients.

Objects and Events as Modeling Drivers.

WebTool An Integrated Framework for Data Mining.
. Large volumes of data such as user address or URL  requested are gathered automatically by Web servers and collected in  access log files. Analysis of server access data can provide significant  and useful information for performance enhancement, and restructuring  a Web site for increased effectiveness. In this paper, we propose an  integrated system (WebTool) for mining user patterns and association  rules from one or more Web servers and pay a particular attention to  handling of time constraints. Once interesting patterns are discovered,  we illustrate how they can be used to customize the server hypertext  organization dynamically.  keywords: data mining, Web usage mining, sequential patterns, time  constraints, association rules.  1 Introduction  With the growing popularity of the World Wide Web (Web), large volumes of data such as address of users or URLs requested are gathered automatically by Web servers and collected in access log files. Analysis of server access data can p...
Webtool un environnement int%E9gr%E9 de data mining.

Extraction efficace de motifs s%E9quentiels  le pr%E9traitement des donn%E9es.

The PSP Approach for Mining Sequential Patterns.
. In this paper, we present an approach, called PSP, for mining  sequential patterns embedded in a database. Close to the problem  of discovering association rules, mining sequential patterns requires handling  time constraints. Originally introduced in [3], the issue is addressed  by the GSP approach [10]. Our proposal resumes the general principles  of GSP but it makes use of a different intermediary data structure which  is proved to be more efficient than in GSP.  1 Introduction  Motivated by decision support problems, data mining, also known as knowledge discovery in databases, has been extensively addressed in the few past years (e.g. [5]). Among takled issues, the problem of mining association rules, initially introduced in [1], has recently received a great deal of attention [1, 2, 4, 5, 9, 11]. The problem of mining association rules is often referred to as the &#034;marketbasket &#034; problem, because purchase transaction data collected by retail stores offers a typical application gr...
Preserving Behaviour Why and How.

Une Aide %E0 la conception et au Contr%F4le de R%E8gles actives.

Views for Information System Design without Reorganization.

Views for Information System Design without Reorganization.

Mod%E9lisation et validation comportementales.

Dynamic Modelling with Events
Abstract The 1999 M 7.1 Hector Mine earthquake ruptured a complex fault system with a branched structure in the north. This fault geometry and slip pattern presents a puzzle, because the northwest branch of this system should be in the stress shadow of the north branch, upon which nucleation likely took place. Through 3D dynamic models of this event, we show that the ability of rupture to propagate to the northwest branch most likely depends on the fact that rupture did not proceed to the surface on the north branch. This slip pattern leads to part of the northwest branch being brought above its failure stress and to subsequent rupture propagation and slip occurring on that branch. A similar effect can be seen in the case in which rupture is constrained not to propagate to the base of the north branch. Models with slip over the entire north branch do not produce rupture propagation and slip on the northwest branch. The results are robust with respect to details of the prestress pattern and hypocenter location. Large heterogeneity over small length scales in the final stress pattern is a natural product of the models, even when the initial stress field is quite homogeneous. We also find that the interaction between fault geometry and stress pattern helps to explain other observations in this event, including slow rupture propagation on the northwest branch. The results help to show that 3D dynamic effects may be crucial in determining rupture propagation and slip behavior on geometrically complex fault systems, although these effects may be hard to predict without detailed knowledge of the stress pattern and fault geometry prior to earthquakes.
IFO2 a Uniform Approach for Information System Modelling.

Towards Event%2DDriven Modelling for Database Design.
ion Pattern. In Proceedings of the Twentieth International Conference on Very Large Databases, pages 630--641, Santiago, Chile, 1994. Materialization is a useful abstraction pattern that can be identified in many application settings. Intuitively, materialization is the relationship between a class of categories (e.g., models of cars) and a class of more concrete objects (e.g., individual cars). The talk gives a precise semantic definition of materialization in terms of the usual is-a and is-of abstractions, and of the class/metaclass correspondence. New and powerful inheritance mechanisms are associated with materialization. Examples, properties, and extensions of materialization are also presented. Providing materialization as an abstraction mechanism for conceptual modeling enhances expressiveness by a controled introduction of classification at the application level.  (4) integration of disparate information systems, (5) re-documentation, (6) data quality assessment and assurance,...
Consistent Structural Updates for Object Database Design

Towards a Formal Approach for Object Database Design.
This paper focuses on a formal approach * for advanced database modeling and design. It is based on the IF02 model, an extension of the semantic model IF0 defined by S. Abiteboul and R. Hull. It preserves the acquired
IFO2
The first step for developing an heterogeneous federated database consists in translating local schemas into a canonical data model. This paper offers a method to transform a relational schema into an equivalent object-oriented one. We study in particular the translation of the nary relationship tables (n&gt;2). The canonical data model we are using is the IFO 2 data model [16], [17], [24]. We translate a relational schema through a combination of data schema and data instance analysis into three stages : deduction of the IFO  2  basic types, deduction of IFO  2  edges and functions, deduction of IFO 2 fragments.  1 Introduction  Following the five level schema architecture of [19], when preexisting databases are to interoperate, a canonical data model common to the whole federation must be adopted. The schemas of the local databases are transformed from their native models to the canonical model giving component schemas. Each component schema is filtered into one or more export schemas. ...
